Strategy-proof and fair assignment is wasteful

نویسنده

  • Giorgio Martini
چکیده

I prove there exists no assignment mechanism that is strategy-proof, non-wasteful and satisfies equal treatment of equals. When outside options may exist, this strengthens the impossibility result of Bogomolnaia and Moulin (2001) by weakening ordinal efficiency to non-wastefulness. My result solves an open question posed by Erdil (2014) and complements his results on the efficient frontier of random assignment mechanisms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strategy-proof stochastic assignment

I study strategy-proof assignment mechanisms where the agents reveal their preference rankings over the available objects. A stochastic mechanism returns lotteries over deterministic assignments, and mechanisms are compared according to first-order stochastic dominance. I show that non-wasteful strategy-proof mechanisms are not dominated by strategy-proof mechanisms, however nonwastefulness is ...

متن کامل

OF CAMBRIDGE Cambridge Working Papers in Economics

I study strategy-proof assignment mechanisms where the agents reveal their preference rankings over the available objects. A stochastic mechanism returns lotteries over deterministic assignments, and mechanisms are compared according to first-order stochastic dominance. I show that non-wasteful strategy-proof mechanisms are not dominated by strategy-proof mechanisms, however nonwastefulness is ...

متن کامل

Strategy-proof matching with regional minimum quotas

This paper considers the matching problem with regional quotas, in particular, regional minimum quotas. Although such quotas are relevant in many real-world settings, there is a lack of strategy-proof mechanisms that consider regional minimum quotas. We first show that without any restrictions on the region structure, finding a feasible matching that satisfies all quotas is NP-complete. Then, a...

متن کامل

School choice with controlled choice constraints: Hard bounds versus soft bounds

Controlled choice over public schools attempts giving parents selection options while maintaining diversity of different student types. In practice, diversity constraints are often enforced by setting hard upper bounds and hard lower bounds for each student type. We demonstrate that, with hard bounds, there might not exist assignments that satisfy standard fairness and non-wastefulness properti...

متن کامل

Optimal radio channel allocation for fair queuing in wireless data networks

In this paper, the problem of fair scheduling in a wireless network is formulated as an assignment problem and an Optimal Radio Channel Allocation (ORCA) strategy is proposed for fair bandwidth allocation in a centralized manner. Simulation results show that the performance improvement due to ORCA can be significant compared to other wireless fairqueuing mechanisms proposed in the literature su...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Games and Economic Behavior

دوره 98  شماره 

صفحات  -

تاریخ انتشار 2016